A Tool for Intersecting Context-Free Grammars and Its Applications
نویسندگان
چکیده
This paper describes a tool for intersecting context-free grammars. Since this problem is undecidable the tool follows a refinementbased approach and implements a novel refinement which is complete for regularly separable grammars. We show its effectiveness for safety verification of recursive multi-threaded programs.
منابع مشابه
Studying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملIntersecting Hierarchical and Phrase-Based Models of Translation: Formal Aspects and Algorithms
We address the problem of constructing hybrid translation systems by intersecting a Hiero-style hierarchical system with a phrase-based system and present formal techniques for doing so. We model the phrase-based component by introducing a variant of weighted finite-state automata, called σ-automata, provide a self-contained description of a general algorithm for intersecting weighted synchrono...
متن کاملRelational Grammars: Theory and Practice in a Visual Language Interface for Process Modeling
Relational Grammars (RGs) are one of the higher-dimensional grammar formalisms that have been proposed for representing visual languages (VLs). This paper serves as an overview of the formalism as well as a case study of its application in a visual language interface (VLI) for process modeling. Relational Grammars are a member of the context-free family of Constraint Multiset Grammars (Marriott...
متن کاملA Practical Algorithm for Intersecting Weighted Context-free Grammars with Finite-State Automata
It is well known that context-free parsing can be seen as the intersection of a contextfree language with a regular language (or, equivalently, the intersection of a context-free grammar with a finite-state automaton). The present article provides a practical efficient way to compute this intersection by converting the grammar into a special finite-state automaton (the GLR(0)-automaton) which i...
متن کاملGrammar Re-Engineering for Language Centered Software Engineering
This paper describes a systematic approach to grammar re-engineering by transforming conventional restricted YACC grammars from legacy code into the purely declarative syntax definition formalism SDF. The declarative nature of SDF and its ability to handle the full class of context-free grammars allows grammar definitions that are more readable and maintainable compared to the original YACC gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015